Optimizing Fast Fourier Transform (FFT) Image Compression using Intelligent Water Drop (IWD) Algorithm
نویسندگان
چکیده
منابع مشابه
Code coverage using intelligent water drop (IWD)
Software testing is one of the most challenging and arduous phase of software development life cycle (SDLC) which helps in determining the software quality. Code coverage is a widely used testing paradigm, which describes the degree to which the code has been tested. Aim of the current paper is to propose an optimised code coverage algorithm with the help of an emerging technique, i.e., intelli...
متن کاملFast Fourier Transform ( FFT )
The DFT can be reduced from exponential time with the Fast Fourier Transform algorithm. Fast Fourier Transform (FFT) One wonders if the DFT can be computed faster: Does another computational procedure an algorithm exist that can compute the same quantity, but more e ciently. We could seek methods that reduce the constant of proportionality, but do not change the DFT's complexity O ( N ) . Here,...
متن کاملFourier Transforms and the Fast Fourier Transform ( FFT ) Algorithm
and the inverse Fourier transform is f (x) = 1 2π ∫ ∞ −∞ F(ω)e dω Recall that i = √−1 and eiθ = cos θ+ i sin θ. Think of it as a transformation into a different set of basis functions. The Fourier transform uses complex exponentials (sinusoids) of various frequencies as its basis functions. (Other transforms, such as Z, Laplace, Cosine, Wavelet, and Hartley, use different basis functions). A Fo...
متن کاملImage Compression and Decompression using nested Inverse Fourier Transform and Fast Fourier Transform
Image compression is the reduction or elimination of redundancy in image data representation in order to achieve savings in storage and communication. In this paper we propose a method for image compression and decompression using nested IFFT and FFT which works on both color and grey images. This technique is simple in implementation and utilizes less memory and also requires less computationa...
متن کاملData Compression Using the Fast Fourier Transform
The Fast Fourier Transform (FFT) technique has long been used for spectral analysis but it has not been fully exploited for data compression purposes. This paper presents the concept for compressing telemetry data using the FFT in such a manner that the time domain waveform can be recovered. The sampled time-domain data is transformed into the frequency-domain data and only the significant comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Interactive Multimedia and Artificial Intelligence
سال: 2022
ISSN: ['1989-1660']
DOI: https://doi.org/10.9781/ijimai.2022.01.004